Search results for " state complexity"

showing 1 items of 1 documents

The average state complexity of rational operations on finite languages is linear

2010

Considering the uniform distribution on sets of m non-empty words whose sum of lengths is n, we establish that the average state complexities of the rational operations are asymptotically linear.

finite languages regular operations automata state complexity average case analysisSettore INF/01 - Informatica
researchProduct